import java.util.*;

public class DAY0409 {
    public int maxNum(List<Integer> nums) {
        // write your code here
        return Collections.max(nums);
    }

    public List<Integer> prime(int n) {
        // write your code here
        List<Integer> nums=new ArrayList<>();
        for (int i = 2; i <=n ; ++i) {
            if(isPrime(i))
                nums.add(i);
        }
        return nums;
    }
    public boolean isPrime(int x){
        for (int i =2 ; i*i <=x ; ++i) {
            if(x%i==0){
                return false;
            }
        }
        return true;
    }

    public List<String> printX(int n) {
        ArrayList<String> res=new ArrayList<>();
        char[] line=new char[n];
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                line[j]=' ';
            }
            line[i]='X';
            line[n-i-1]='X';
            res.add(String.valueOf(line));
        }
        return res;
    }

    public void sortIntegers(int[] a) {
        // write your code here
        Arrays.sort(a);
        System.out.println(a);
    }

    public List<String> fizzBuzz(int n) {
        // write your code here
        List<String> str=new ArrayList<>();
        for (int i = 1; i <=n; i++) {
            if (i%15==0){
                str.add("fizz buzz");
            } else if (i%5==0) {
                str.add("buzz");
            } else if (i%3==0) {
                str.add("fizz");
            }else {
                str.add(String.valueOf(i));
            }
        }
        return str;
    }

    public int[] rotate(int[] nums, int k) {
        int n = nums.length;
        int[] newArr = new int[n];
        for (int i = 0; i < n; ++i) {
            newArr[(i + k) % n] = nums[i];
        }
        return newArr;
    }

    public int majorityNumber(List<Integer> nums) {
        // write your code here
        Collections.sort(nums);
        return nums.get(nums.size()/2);
    }

    public List<Long> productExcludeItself(List<Integer> nums) {
        // write your code here
        int length = nums.size();
        Long[] answer = new Long[length];

        // answer[i] 表示索引 i 左侧所有元素的乘积
        // 因为索引为 '0' 的元素左侧没有元素， 所以 answer[0] = 1
        answer[0] = 1l;
        for (int i = 1; i < length; i++) {
            answer[i] = nums.get(i - 1) * answer[i - 1];
        }

        // R 为右侧所有元素的乘积
        // 刚开始右边没有元素，所以 R = 1
        long R = 1l;
        for (int i = length - 1; i >= 0; i--) {
            // 对于索引 i，左边的乘积为 answer[i]，右边的乘积为 R
            answer[i] = answer[i] * R;
            // R 需要包含右边所有的乘积，所以计算下一个结果时需要将当前值乘到 R 上
            R *= nums.get(i);
        }
        List<Long> resultList= new ArrayList<>(Arrays.asList(answer));
        return resultList;
    }

    public String reverseWords(String s) {
        // write your code here
        s=s.trim();
        List<String>strings=Arrays.asList(s.split("\\s+"));
        Collections.reverse(strings);
        return String.join(" ",strings);
    }

    public int[] plusOne(int[] digits) {
        // write your code here
        int extra = 1;
        for (int i = digits.length - 1; i >= 0; i--) {
            int sum = digits[i] + extra;
            digits[i] = sum % 10;
            extra = sum / 10;
            if (extra == 0) {
                break;
            }
        }
        if (extra == 0) {
            return digits;
        }
        int[] result = new int[digits.length + 1];
        result[0] = 1;
        return result;
    }

    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        while (sc.hasNextInt()){
            int a=sc.nextInt();
            List<String> str=fun(a);
            System.out.printf("%d = %s\n",a,String.join(" * ",str));
        }
    }
    public static List<String> fun(int a){
        List<String>str=new ArrayList<>();
        for (int i = 2; a >1&&i*i<=a ; i++) {
            while (a%i==0){
                str.add(String.valueOf(i));
                a=a/i;
            }
        }
        if(a>1){
            str.add(String.valueOf(a));
        }
        return str;
    }




}
